Persistence in Computational Geometry 1
نویسنده
چکیده
We show how persistence can be used to solve a number of geometric problems where prepro-cessing is required to facilitate query answering. EEcient solutions for most of the problems discussed already exist in the literature; however, persistence provides an eecient and conceptually simpler alternative to existing solutions.
منابع مشابه
Fréchet Means for Distributions of Persistence Diagrams
Given a distribution ρ on persistence diagrams and observations X1, ...Xn iid ∼ ρ we introduce an algorithm in this paper that estimates a Fréchet mean from the set of diagrams X1, ...Xn. If the underlying measure ρ is a combination of Dirac masses ρ = 1 m ∑m i=1 δZi then we prove the algorithm converges to a local minimum and a law of large numbers result for a Fréchet mean computed by the alg...
متن کاملParleda: a Library for Parallel Processing in Computational Geometry Applications
ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...
متن کاملComputational Geometry: Generalized (or Colored) Intersection Searching
Michiel Smid Carleton University, Ottawa 1.1 Geometric intersection searching problems . . . . . . . . 1-1 Generalized intersection searching 1.2 Summary of known results . . . . . . . . . . . . . . . . . . . . . . . . . . . 1-3 Axes-parallel objects • Arbitrarily-oriented objects • Problems on the grid • Single-shot problems • External memory and word-RAM algorithms 1.3 Techniques . . . . . . ...
متن کاملThe density of expected persistence diagrams and its kernel based estimation
Persistence diagrams play a fundamental role in Topological Data Analysis where they are used as topological descriptors of filtrations built on top of data. They consist in discrete multisets of points in the plane R2 that can equivalently be seen as discrete measures in R2. When the data come as a random point cloud, these discrete measures become random measures whose expectation is studied ...
متن کاملStability of Critical Points with Interval Persistence
Scalar functions defined on a topological space Ω are at the core of many ap-plications such as shape matching, visualization and physical simulations. Topo-logical persistence is an approach to characterizing these functions. It measureshow long topological structures in the sub-level sets {x ∈ Ω : f(x) ≤ c} persistas c changes. Recently it was shown that the critical values de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995